A Sexual Genetic Algorithm Based System For Automatically Tunning Constraint Satisfaction Problems

نویسندگان

  • Hu Xu
  • Karen Petrie
چکیده

Finding a efficient or correct choice of preprocessing level can reduce the search time of a constraint solver to find a solution to a constraint problem. Currently the parameters in constraint solver are often picked by hand by experts in the field. Sexual Genetic Algorithm are a algorithm which applies two different selection strategies during the mating. In this paper the efficiency of Sexual Genetic Algorithm(SGA) will be firstly proved by solving the Travel Salesman Problem (TSP). After that SGA will be used to create an automatic preprocessing selection mechanism for solving various constraint problems. The experiments in the paper are a proof of concept for the idea of combining sexual genetic algorithms ability with constraint programming to aid in the parameter selection issue.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

Using Self-learning and Automatic Tuning to Improve the Performance of Sexual Genetic Algorithms for Constraint Satisfaction Problems

Currently the parameters in a constraint solver are often selected by hand by experts in the field; these parameters might include the level of preprocessing to be used and the variable ordering heuristic. The efficient and automatic choice of a preprocessing level for a constraint solver is a step towards making constraint programming a more widely accessible technology. Self-learning sexual g...

متن کامل

STRUCTURAL SYSTEM RELIABILITY-BASED OPTIMIZATION OF TRUSS STRUCTURES USING GENETIC ALGORITHM

Structural reliability theory allows structural engineers to take the random nature of structural parameters into account in the analysis and design of structures. The aim of this research is to develop a logical framework for system reliability analysis of truss structures and simultaneous size and geometry optimization of truss structures subjected to structural system reliability constraint....

متن کامل

A parameter-tuned genetic algorithm for vendor managed inventory model for a case single-vendor single-retailer with multi-product and multi-constraint

This paper develops a single-vendor single-retailer supply chain for multi-product. The proposed model is based on Vendor Managed Inventory (VMI) approach and vendor uses the retailer's data for better decision making. Number of orders and available capital are the constraints of the model. In this system, shortages are backordered; therefore, the vendor’s warehouse capacity is another limitati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013